Tilings, groves and multiset permutations: asympotics of rational generating functions whose pole set includes a cone
نویسندگان
چکیده
We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist cone points, near which one of the factors is asymptotic to a nondegenerate quadratic. We compute the asymptotics of the coefficients of such a generating function. The computation requires some topological deformations as well as Fourier-Laplace transforms of generalized functions. We apply the results of the theory to specific combinatorial problems.
منابع مشابه
Asymptotics of multivariate sequences, part III: quadratic points
We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic to a nondegenerate quadratic. We compute the asymptotics of the coefficients of such a generating function. The computation requires some topological deforma...
متن کاملec 2 00 8 Asymptotics of multivariate sequences , part III : quadratic points
We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic to a nondegenerate quadratic. We compute the asymptotics of the coefficients of such a generating function. The computation requires some topological deforma...
متن کاملRegular closed sets of permutations
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets to be enumerated by rational generating functions. As a consequence we give the first non-trivial examples of pattern closed sets of permutations all of whose closed subclasses ha...
متن کاملLoopless generation of multiset permutations using a constant number of variables by prefix shifts
This paper answers the following mathematical question: Can multiset permutations be ordered so that each permutation is a prefix shift of the previous permutation? Previously, the answer was known for the permutations of any set, and the permutations of any multiset whose corresponding set contains only two elements. This paper also answers the following algorithmic question: Can multiset perm...
متن کاملLoopless Generation of Multiset Permutations by Prefix Shifts
This paper answers the following mathematical question: Can multiset permu-tations be ordered so that each permutation is a prefix shift of the previous permutation?Previously, the answer was known for the permutations of any set, and the permutationsof any multiset whose corresponding set contains only two elements. This paper also an-swers the following algorithmic question: C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008